Solvability of norm equations over cyclic number fields of prime degree

Solvability of norm equations over cyclic number fields of prime degree

Let L = Q[α] be an abelian number field of prime degree q, and let a be a nonzero rational number. We describe an algorithm which takes as input a and the minimal polynomial of α over Q, and determines if a is a norm of an element of L. We show that, if we ignore the time needed to obtain a complete factorization of a and a complete factorization of the discriminant of α, then the algorithm run...

Norm-euclidean Cyclic Fields of Prime Degree

Let K be a cyclic number field of prime degree `. Heilbronn showed that for a given ` there are only finitely many such fields that are normEuclidean. In the case of ` = 2 all such norm-Euclidean fields have been identified, but for ` 6= 2, little else is known. We give the first upper bounds on the discriminants of such fields when ` > 2. Our methods lead to a simple algorithm which allows one...

On the Distribution of Cyclic Number Fields of Prime Degree

Let N Cp (X) denote the number of C p Galois extensions of Q with absolute discriminant ≤ X. A well-known theorem of Wright [1] implies that when p is prime, we have N Cp (X) = c(p)X 1 p−1 + O(X 1 p) for some positive real c(p). In this paper, we improve this result by reducing the secondary error term to O(X

Finding Normal Integral Bases of Cyclic Number Fields of Prime Degree

Solvability of Systems of Two Polynomial Equations over Finite Fields

In this paper we determine the solvability of families of systems of two polynomial equations over finite fields by computing the exact divisibility of the exponential sums associated to the systems. This generalizes a theorem of Carlitz to systems of two equations. Our result gives an upper bound for the Waring number of systems of diagonal equations. Also, as a by-product, we also obtain info...